SIGMA ₁¹-FORMULAE ON FINITE STRUCTURESAJTAI M.1983; ANNALS OF MATHEMATICAL LOGIC; ISSN 0003-4843; NLD; DA. 1983; VOL. 24; NO 1; PP. 1-48; BIBL. 3 REF.Article

MONADIC THEORY OF ORDER AND TOPOLOGY IN ZFCGUREVICH Y; SHELAH S.1982; ANNALS OF MATHEMATICAL LOGIC; ISSN 0003-4843; NLD; DA. 1982; VOL. 23; NO 2-3; PP. 179-198; BIBL. 12 REF.Article

Interpreting second-order logic in the monadic theory of orderGUREVICH, Y; SHELAH, S.The Journal of symbolic logic. 1983, Vol 48, Num 3, pp 816-828, issn 0022-4812Article

THE COMPLEXITY OF AUTOMATA AND SUBTHEORIES OF MONADIC SECOND ORDER ARITHMETICSMOSTOWSKI AW.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 453-466; BIBL. 19 REF.Conference Paper

UNPROVABILITY OF THEOREMS OF COMPLEXITY THEORY IN WEAK NUMBER THEORIESLEIVANT D.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 18; NO 3; PP. 259-268; BIBL. 19 REF.Article

ON A SECOND ORDER PROPOSITIONAL OPERATOR IN INTUITIONISTIC LOGICTROELSTRA AS.1981; STUD. LOGICA; ISSN 0039-3215; POL; DA. 1981; VOL. 40; NO 2; PP. 113-139; BIBL. 20 REF.Article

MOSEL: A sound and efficient tool for M2L(Str)KELB, P; MARGARIA, T; MENDLER, M et al.Lecture notes in computer science. 1997, pp 448-451, issn 0302-9743, isbn 3-540-63166-6Conference Paper

On some non-classical extensions of second-order intuitionistic propositional calculusŠČEDROV, A.Annals of pure and applied logic. 1984, Vol 27, Num 2, pp 155-164, issn 0168-0072Article

Lower bound results on lengths of second-order formulasSCARPELLINI, B; HARTMANIS, J.Annals of pure and applied logic. 1985, Vol 29, Num 1, pp 29-58, issn 0168-0072Article

CONTEXT-FREE LANGUAGES, GROUPS, THE THEORY OF ENDS, SECOND-ORDER LOGIC, TILING PROBLEMS, CELLULAR AUTOMATA, AND VECTOR ADDITION SYSTEMSMULLER DE; SCHUPP PE.1981; BULL. AM. MATH. SOC.; ISSN 0002-9904; USA; DA. 1981; VOL. 4; NO 3; PP. 331-334; BIBL. 4 REF.Article

Prefix-recognizable graphs and monadic logicLEUCKER, Martin.Lecture notes in computer science. 2002, pp 263-283, issn 0302-9743, isbn 3-540-00388-6, 21 p.Conference Paper

Monadic second-order evaluations on tree-decomposable graphsCOURCELLE, B; MOSBAH, M.Theoretical computer science. 1993, Vol 109, Num 1-2, pp 49-82, issn 0304-3975Conference Paper

Expressive power of monadic second-order logic and modal μ-calculusROHDE, Philipp.Lecture notes in computer science. 2002, pp 239-259, issn 0302-9743, isbn 3-540-00388-6, 21 p.Conference Paper

Expressiveness and completeness of an interval tense logicVENEMA, Y.Notre Dame journal of formal logic. 1990, Vol 31, Num 4, pp 529-547, issn 0029-4527Article

The predicate-minimizing logic MINMARTINS FERREIRA, Francicleber; MARTINS, Ana Teresa.Lecture notes in computer science. 2006, pp 582-591, issn 0302-9743, isbn 3-540-45462-4, 1Vol, 10 p.Conference Paper

New graph classes of bounded clique-widthBRANDSTÄDT, Andreas; DRAGAN, Feodor F; LE, Hoang-Oanh et al.Lecture notes in computer science. 2002, pp 57-67, issn 0302-9743, isbn 3-540-00331-2, 11 p.Conference Paper

Monadic second-order logic over rectangular pictures and recognizability by tiling systemsGIAMMARRESI, D; RESTIVO, A; SEIBERT, S et al.Information and computation (Print). 1996, Vol 125, Num 1, pp 32-45, issn 0890-5401Article

Functions and functionals on finite systemsLO, L.The Journal of symbolic logic. 1992, Vol 57, Num 1, pp 118-130, issn 0022-4812Article

The Hanf numbers of stationary logic II : Comparison with other logicsSHELAH, S.Notre Dame journal of formal logic. 1992, Vol 33, Num 1, pp 1-12, issn 0029-4527Article

Eventual periodicity and «one-dimensional» queriesMCCOLM, G. L.Notre Dame journal of formal logic. 1992, Vol 33, Num 2, pp 273-290, issn 0029-4527Article

On the expressive power of graph logicMARCINKOWSKI, Jerzy.Lecture notes in computer science. 2006, pp 486-500, issn 0302-9743, isbn 3-540-45458-6, 1Vol, 15 p.Conference Paper

Automata and logics for unranked and unordered treesBONEVA, Iovka; TALBOT, Jean-Marc.Lecture notes in computer science. 2005, pp 500-515, issn 0302-9743, isbn 3-540-25596-6, 16 p.Conference Paper

The monadic second-order logic of graphs. V: On closing the gap between definability and recognizabilityCOURCELLE, B.Theoretical computer science. 1991, Vol 80, Num 2, pp 153-202, issn 0304-3975Article

Formalizing Dijkstra's predicate transformer wp in weak second-order logicBERGHAMMER, R; ELBL, B; SCHMERL, U et al.Theoretical computer science. 1995, Vol 146, Num 1-2, pp 185-197, issn 0304-3975Article

An algebraic account of modularity in ID-logicVENNEKENS, Joost; DENECKER, Marc.Lecture notes in computer science. 2005, pp 291-303, issn 0302-9743, isbn 3-540-28538-5, 13 p.Conference Paper